Complete graph

Results: 868



#Item
81Graph theory / NP-complete problems / Graph coloring / Triangle-free graph / Treewidth / Independent set / Planar graph / Line graph / Perfect graph / Dominating set / Clique cover / Graph minor

Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-01-12 16:30:06
82Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Independent set / Clique problem / Algorithm / Clique / Matching

Genome Informatics 13: 143–Point Matching Under Non-Uniform Distortions and Protein Side Chain Packing Based on an Efficient

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2002-12-09 05:53:39
83Graph theory / Computational complexity theory / Mathematics / Edsger W. Dijkstra / Network theory / Topological graph theory / Shortest path problem / M3U / NP-complete problems

Microsoft Word - musicExplorerLab.doc

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:37:03
84Graph theory / NP-complete problems / Circle graph / Intersection graph / Dominating set / Interval graph / Chordal graph / Graph coloring / Treewidth / Claw-free graph / Clique / Planar graph

TOCS9478_source.nohead.pdf

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-05-14 08:02:16
85Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Hamiltonian path / Eulerian path / Travelling salesman problem / Cycle / Seven Bridges of Knigsberg / Path / NP-completeness / Shortest path problem

CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

Add to Reading List

Source URL: www.cs.bilkent.edu.tr

Language: English - Date: 2012-03-26 04:52:47
86Computational complexity theory / Graph theory / Mathematics / NP-complete problems / Combinatorial optimization / Matching / Vertex cover / Gene

The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:58
87Graph theory / Mathematics / NP-complete problems / Degree / Algebraic graph theory / Covering graph / Line graph

Spectral Graph Theory and Applications WSLecture 7: Hitting Time and Cover Time of Random Walks Lecturer: Thomas Sauerwald & He Sun

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2011-12-08 09:45:37
88Graph theory / Mathematics / NP-complete problems / Matroid theory / Steiner tree problem / Bipartite graph / Eulerian path / Graph / Degree / Ear decomposition / Directed graph / Cycle

CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-18 01:28:39
89Graph theory / NP-complete problems / Pathwidth / Clique problem

MCS 401 – Computer Algorithms I Spring 2016 Problem Set 4 Lev Reyzin Due: by the beginning of class

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2016-03-11 11:13:37
90Graph theory / NP-complete problems / Longest path problem / Interval graph / Hamiltonian path / Independent set / Chordal graph / Indifference graph / Path / Permutation graph / Pathwidth / Graph coloring

The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-06-12 14:16:54
UPDATE